Automating Non-Unimodular Loop Transformations for Massive Parallelism
نویسنده
چکیده
Loop transformations have been shown to be very useful in parallelising compilation and regular array design. This paper provides a solution to the open problem of automatic rewriting loop nests for non-unimodular loop transformations. We present an algorithm that rewrites a loop nest under any non-singular (unimodular or non-unimodular) transformation in a mechanical manner. The algorithm works nicely with unimodular transformations being treated as a special case. The extra time complexity incurred due to non-unimodularity is polynomially bounded by the depth of the loop nest.
منابع مشابه
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
AbstructThis paper proposes a new approach to transformations for general loop nests. In this approach, we unify all combinations of loop interchange, skewing and reversal as unimodular transformations. The use of matrices to model transformations has previously been applied only to those loop nests whose dependences can be summarized by distance vectors. Our technique is applicable to general ...
متن کاملUnimodular Transformations of Non-Perfectly Nested Loops
A framework is described in which a class of imperfectly nested loops can be restructured using unimodular transformations. In this framework, an imperfect loop nest is converted to a perfect loop nest using Abu-Sufah's Non-Basic-to-Basic-Loop transformation. Conditions for the legality of this transformation and techniques for their veriication are discussed. An iteration space, which extends ...
متن کاملAn Algorithm to Automate Non-Unimodular Transformations of Loop Nests
This paper provides a solution to the open problem of automatic rewriting loop nests for non-unimodular transformations. We present an algorithm that rewrites a loop nest under any non-singular (unimod-ular or non-unimodular) transformation. The algorithm works nicely with unimodular transformations being treated as a special case. The rst step of the algorithm calculates the loop bounds using ...
متن کاملMaximizing Parallelism and Minimizing Synchronization with Affine Partitions
This paper presents an algorithm to find the optimal affine partitions that maximize the degree of parallelism and minimize the degree of synchronization in programs with arbitrary loop nestings and affine data accesses. The problem is formulated without the use of imprecise data dependence abstractions such as data dependence vectors. The algorithm presented subsumes previously proposed loop t...
متن کاملNon - unimodular Transformations of Nested
This paper presents a linear algebraic approach to modeling loop transformations. The approach uniies apparently unrelated recent developments in super-compiler technology. Speciically we show the relationship between the dependence abstraction called dependence cones, and fully permutable loop nests. Compound transformations are modeled as matrices. Non-singular linear transformations presente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 20 شماره
صفحات -
تاریخ انتشار 1994